ADAPTING SEARCH ACCORDING TO QUERIES: Experimental studies
نویسنده
چکیده
WWW information access is based on search engines. Most of the users consider a single search engine that they will use whatever their queries are. Additionally, current search engines follow a general framework and they treat all the queries in the same way. In this paper, we present experiments that show that considering variability both in terms of systems and in terms of queries would improve the results of a search. We based our experiments on the data from the international evaluation forum TREC (200 topics, several Gbytes of documents). This forum simulates search engine usage and gives access to topics, document collections, expected documents and system answers. We show that high precision can be improved by automatically deciding which system should be used for a given query. In our approach, system selection is based on query clustering; queries are clustered considering linguistic features that are automatically extracted from queries. We show that high precision (P@5) is improved by 8.9% for P@5 over the best system for TREC 5 for example. We also show that considering a larger set of collections, P@5 is improved of about 5%, when considering a learning/testing evaluation framework.
منابع مشابه
Analysis of users’ query reformulation behavior in Web with regard to Wholis-tic/analytic cognitive styles, Web experience, and search task type
Background and Aim: The basic aim of the present study is to investigate users’ query reformulation behavior with regard to wholistic-analytic cognitive styles, search task type, and experience variables in using the Web. Method: This study is an applied research using survey method. A total of 321 search queries were submitted by 44 users. Data collection tools were Riding’s Cognitive Style A...
متن کاملEfficient Support for Range Queries and Range Updates Using Contention Adapting Search Trees
We extend contention adapting trees (CA trees), a family of concurrent data structures for ordered sets, to support linearizable range queries, range updates, and operations that atomically operate on multiple keys such as bulk insertions and deletions. CA trees differ from related concurrent data structures by adapting themselves according to the contention level and the access patterns to sca...
متن کاملمدل جدیدی برای جستجوی عبارت بر اساس کمینه جابهجایی وزندار
Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...
متن کاملExternal Plagiarism Detection based on Human Behaviors in Producing Paraphrases of Sentences in English and Persian Languages
With the advent of the internet and easy access to digital libraries, plagiarism has become a major issue. Applying search engines is one of the plagiarism detection techniques that converts plagiarism patterns to search queries. Generating suitable queries is the heart of this technique and existing methods suffer from lack of producing accurate queries, Precision and Speed of retrieved result...
متن کاملFaster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data
The need for scalable concurrent ordered set data structures with linearizable range query support is increasing due to the rise of multicore computers, data processing platforms and in-memory databases. This paper presents a new concurrent ordered set with linearizable range query support. The new data structure is based on the contention adapting search tree and an immutable data structure. E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008